Directed Perturbation Analysis of an Integer Program
نویسندگان
چکیده
منابع مشابه
a swot analysis of the english program of a bilingual school in iran
با توجه به جایگاه زبان انگلیسی به عنوان زبانی بین المللی و با در نظر گرفتن این واقعیت که دولت ها و مسئولان آموزش و پرورش در سراسر جهان در حال حاضر احساس نیاز به ایجاد موقعیتی برای کودکان جهت یاد گیری زبان انگلیسی درسنین پایین در مدارس دو زبانه می کنند، تحقیق حاضر با استفاده از مدل swot (قوت ها، ضعف ها، فرصتها و تهدیدها) سعی در ارزیابی مدرسه ای دو زبانه در ایران را دارد. جهت انجام این تحقیق در م...
15 صفحه اولan infinite planar array of rectangular microstrip patch antenna analysis
the methods which are used to analyze microstrip antennas, are divited into three categories: empirical methods, semi-empirical methods and full-wave analysis. empirical and semi-empirical methods are generally based on some fundamental simplifying assumptions about quality of surface current distribution and substrate thickness. thses simplificatioms cause low accuracy in field evaluation. ful...
15 صفحه اولInteger Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from imprecision when it is necessary to take into account the integrality of the represented space. Imprecision also arises when non-linear constraints occur. Moreover, in terms of tractability, even a space defined by linear...
متن کاملProgram Analysis with Presburger Integer Formulae
A procedure employing Presburger integer formulae for a constraint style program analysis is described. Presburger integer constraints are used to locate dead code fragments in a style similar to conditional constant propagation after conversion to a form similar to SSA. Then, an algorithm for proving strong loop termination is presented based on the generation of constraints on the program in ...
متن کاملOn Spectral Analysis of Directed Graphs with Graph Perturbation Theory
The eigenspace of the adjacency matrix of a graph possesses important information about the network structure. Recent works showed the existence of line orthogonality patterns when nodes are projected into the eigenspaces of graphs by either SVD or regular eigen decomposition. Further study proved why such phenomena hold true for simple graphs using matrix perturbation theory and several graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1996
ISSN: 0022-247X
DOI: 10.1006/jmaa.1996.0266